Distributed Function Computation Over a Rooted Directed Tree
نویسندگان
چکیده
منابع مشابه
On Rooted Directed Path Graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple. Two non adjacent vertices are linked by a special connection if either they have a common neighbor or they are the endpoints of two vertex-dis...
متن کاملTree Decomposition based Steiner Tree Computation over Large Graphs
In this paper, we present an exact algorithm for the Steiner tree problem. The algorithm is based on certain pre-computed index structures. Our algorithm offers a practical solution for the Steiner tree problems on graphs of large size and bounded number of terminals.
متن کاملRooted edges of a minimal directed spanning tree on random points
For n i.i.d. uniform points in [0, 1]d, d ≥ 2, let Ln be the total distance from the origin to all the minimal points under the coordinate-wise partial order (this is also the total length of rooted edges of a minimal directed spanning tree on the given n random points). For d ≥ 3, we establish the asymptotics of the mean and the variance of Ln, and show that Ln satisfies a central limit theore...
متن کاملApproximating the minmax rooted-tree cover in a tree
Given an edge-weighted rooted tree T and a positive integer p ( n), where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O(n) time (2 + ε)-approximat...
متن کاملDistributed Mirror Descent over Directed Graphs
In this paper, we propose Distributed Mirror Descent (DMD) algorithm for constrained convex optimization problems on a (strongly-)connected multi-agent network. We assume that each agent has a private objective function and a constraint set. The proposed DMD algorithm employs a locally designed Bregman distance function at each agent, and thus can be viewed as a generalization of the well-known...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2530398